A Fast Recursive Algorithm to Compute LocalAxial
نویسندگان
چکیده
Aim of the paper is to describe an application of a fast recursive algorithm to the computation of the local axial moment of a gray level image. The fast algorithm allows to reduce the computation complexity to O(n) where n is the input size. This result is of interest in real time image applications with more than 10 6 pixels. Experiments on real data validate the theoretical previsions.
منابع مشابه
An Adaptive Algorithm for Fast Identification of IIR Systems
This paper considers the problem of adaptive identification of IIR systems when the system output is corrupted by noise. The standard recursive least squares algorithm is known to produce biased parameter estimates in this case. A new type of fast recursive identification algorithm is proposed which is built upon approximate inverse power iteration. The proposed adaptive algorithm can recursive...
متن کاملFast Adaptive Blind Beamforming Technique for Cyclostationary Signals
Castedo et al. have present a blind beamforming criterion based on the property of cyclostationary signals. A stochastic gradient-based algorithm, which needs to choose the step size suitably, was derived to compute the optimum weight vector. In this paper a fast adaptive algorithm is proposed. We show that the recursive least square techniques can be applied to solve this problem successfully ...
متن کاملThe Josephus Problem
Lorenz Halbeisen, ETH Z urich Norbert Hungerb uhler, University of Freiburg (Germany) Abstract We give explicit non-recursive formulas to compute the Josephus-numbers j(n; 2; i) and j(n; 3; i) and explicit upper and lower bounds for j(n; k; i) (where k 4) which di er by 2k 2 (for k = 4 the bounds are even better). Furthermore we present a new fast algorithm to calculate j(n; k; i) which is ba...
متن کاملFast Algorithms with low Complexity for Adaptive Filtering
— The numerically stable version of fast recursive least squares (NS-FRLS) algorithms represent a very important load of calculation that needs to be reduced. Its computational complexity is of 8L operations per sample, where L is the finite impulse response filter length. We propose an algorithm for adaptive filtering, while maintaining equilibrium between its reduced computational complexity ...
متن کاملAdvanced Algorithms for Adaptive Filtering
In this paper, we evaluate the possibility to develop algorithms of adaptation for the applications system of acoustic echo cancellation, while maintaining equilibrium between its reduced calculation complexity and its adaptive performances. We present new algorithms versions of fast recursive least squares numerically stable (NS-FRLS). They are obtained by means of redundant formulas, availabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007